Quantum Computation and Real Multiplication
نویسندگان
چکیده
We propose a construction of anyon systems associated to quantum tori with real multiplication and the embedding of quantum tori in AF algebras. These systems generalize the Fibonacci anyons, with weaker categorical properties, and are obtained from the basic modules and the real multiplication structure.
منابع مشابه
Tuning Technique for Multiple Precision Dense Matrix Multiplication using Prediction of Computational Time
Although reliable long precision floating-point arithmetic libraries such as QD and MPFR/GMP are necessary to solve ill-conditioned problems in numerical simulation, long precision BLAS-level computation such as matrix multiplication has not been fully optimized because tuning costs are very high compared to IEEE float and double precision arithmetic. In this study, we develop a technique to sh...
متن کاملProblem Complexity Research from Energy Perspective
Computational complexity is a particularly important objective. The idea of Landauer principle was extended through mapping three classic problems (sorting、 ordered searching and max of N unordered numbers) into Maxwell demon thought experiment in this paper. The problems’ complexity is defined on the entropy basis and the minimum energy required to solve them are rigorous deduced from the pers...
متن کاملEvolving Quantum Oracles with Hybrid Quantum-inspired Evolutionary Algorithm
Quantum oracles play key roles in the studies of quantum computation and quantum information. But implementing quantum oracles efficiently with universal quantum gates is a hard work. Motivated by genetic programming, this paper proposes a novel approach to evolve quantum oracles with a hybrid quantum-inspired evolutionary algorithm. The approach codes quantum circuits with numerical values and...
متن کاملTheoretically optimal computing frontiers for rapid multiplication through decomposition
The productivity of the computation systems is determined to a high degree by the speed of multiplication, which is а basic element in multiple applications for digital signal processing, quantum computations, etc. The various approaches for design of asymptotically rapid algorithms for multiplication have developed in parallel with the evolution of the effective multiplicator architectures. Th...
متن کاملQuantum hyperparallel algorithm for matrix multiplication.
Hyperentangled states, entangled states with more than one degree of freedom, are considered as promising resource in quantum computation. Here we present a hyperparallel quantum algorithm for matrix multiplication with time complexity O(N(2)), which is better than the best known classical algorithm. In our scheme, an N dimensional vector is mapped to the state of a single source, which is sepa...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Mathematics in Computer Science
دوره 9 شماره
صفحات -
تاریخ انتشار 2015